An Inconsistency Sensitive Arrangement Algorithm for Curve Segments
نویسندگان
چکیده
We present a robust arrangement algorithm for algebraic curves based on floating point arithmetic. The algorithm performs a line sweep, tests the consistency of each sweep update, and modifies the input to prevent inconsistent updates. The output arrangement is realizable by semi-algebraic curves that are close to the input curves. We present a new performance model for robust computational geometry in which running times and error bounds are expressed in terms of the number of input inconsistencies. An inconsistency is a combinatorial property that is derivable with a given set of numerical algorithms, but that is not realizable. The running time of the arrangement algorithm is O((n + N) log n + k(n + N) log n) for n curves with N intersection points and with k = O(n) inconsistencies. The distance between the realization curves and the input is O( + kn ) where is the curve intersection accuracy. The output size is always the standard O(n+N). We show experimentally that k is zero for generic inputs and is tiny even for highly degenerate inputs. Hence, the algorithm running time on real-world inputs equals that of a standard sweep and the realization error equals the curve intersection error.
منابع مشابه
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perform online walks inside such an arrangement (i.e., compute all the faces that a curve, given in an online manner crosses), and to compute a level in an arrangement, both in an output-sensitive manner. The expected runni...
متن کاملAlternative Conditions to Time Inconsistency Equilibrium of an International Monetary Policy
Monetary policy rule is an approach to avoid time inconsistency problem as regarded by new classical economist to choose a time plan for policy making in order to maximize householdsâ well-being. The foundation of time inconsistency problem is not coincidence of expectations as an ex-ante variable, which is expected variable, with actual variable as an ex-post variable. Expectations in Finn K...
متن کاملAn intersection-sensitive algorithm for snap rounding
Snap rounding is a method for converting arbitrary-precision arrangements of segments into fixed-precision representation. We present an algorithm for snap rounding with running time O((n + I) log n), where I is the number of intersections between the input segments. In the worst case, our algorithm is an order of magnitude more efficient than the best previously known algorithms. We also propo...
متن کاملModeling the Operational Speed of Tangents and Curves in Four-lane Highways Based on Geometric and Roadside Factors
Operational speed is an index that represents drivers’ speeding behaviors and shows the comfort and safety levels they experience. Many models had been proposed to predict operational speed in tangent and curve segments of highways. Most of these works had used geometric, with few of them conducted using roadside variables to predict operational speed. Also, the operational speed study in multi...
متن کاملExact , Efficient , and Complete Arrangement Computation for Cubic Curves 1
The Bentley-Ottmann sweep-line method can compute the arrangement of planar curves, provided a number of geometric primitives operating on the curves are available. We discuss the reduction of the primitives to the analysis of curves and curve pairs, and describe efficient realizations of these analyses for planar algebraic curves of degree three or less. We obtain a complete, exact, and effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003